Linear Evasion Problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Pursuit-Evasion Problems on Height Maps

In this paper we present an approach for a pursuit-evasion problem that considers a 2.5d environment represented by a height map. Such a representation is particularly suitable for large-scale outdoor pursuit-evasion. By allowing height information we not only capture some aspects of 3d visibility but can also consider target heights. In our approach we construct a graph representation of the e...

متن کامل

Some Pursuit-Evasion Problems on Grids

Dawes, R.W., Some pursuit-evasion problems on grids, Information Processing Letters 43 (1992) 241-247. In a rectangular grid, a pursuit-evation “game” is played according to simple rules. One player (the cop) wins if both players ever occupy either the same row or the same column of the grid. The other player (the robber) wins if the cop loses. Movement of the players is restricted to the rows ...

متن کامل

Evasion Attack of Multi-class Linear Classifiers

Machine learning has yield significant advances in decision-making for complex systems, but are they robust against adversarial attacks? We generalize the evasion attack problem to the multi-class linear classifiers, and present an efficient algorithm for approximating the optimal disguised instance. Experiments on real-world data demonstrate the effectiveness of our method.

متن کامل

Classifier Evasion: Models and Open Problems

As a growing number of software developers apply machine learning to make key decisions in their systems, adversaries are adapting and launching ever more sophisticated attacks against these systems. The near-optimal evasion problem considers an adversary that searches for a low-cost negative instance by submitting a minimal number of queries to a classifier, in order to effectively evade the c...

متن کامل

SENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS

In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary. 

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers

سال: 1975

ISSN: 0453-4654

DOI: 10.9746/sicetr1965.11.63